翻訳と辞書
Words near each other
・ Constant Object Proportion Rendering
・ Constant of integration
・ Constant of motion
・ Constant Permeke
・ Constant phase element
・ Constant Pierre
・ Constant Plessis
・ Constant power circuit
・ Constant Pressure System
・ Constant problem
・ Constant proportion debt obligation
・ Constant proportion portfolio insurance
・ Constant Prévost
・ Constant purchasing power accounting
・ Constant Puyo
Constant Q transform
・ Constant Riley W. Bixby House
・ Constant Roux
・ Constant Rémy
・ Constant scalar curvature Kähler metric
・ Constant Shallowness Leads to Evil
・ Constant sheaf
・ Constant Soulier
・ Constant spectrum melody
・ Constant speed drive
・ Constant Spring F.C.
・ Constant Spring, Jamaica
・ Constant strain triangle element
・ Constant structure
・ Constant term


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Constant Q transform : ウィキペディア英語版
Constant Q transform
In mathematics and signal processing, the Constant Q Transform transforms a data series to the frequency domain. It is related to the Fourier Transform,〔Judith C. Brown, (Calculation of a constant Q spectral transform ), ''J. Acoust. Soc. Am.'', 89(1):425–434, 1991.〕 and very closely related to the complex Morlet wavelet transform.〔(Continuous Wavelet Transform ) "When the mother wavelet can be interpreted as a windowed sinusoid (such as the Morlet wavelet), the wavelet transform can be interpreted as a constant-Q Fourier transform. Before the theory of wavelets, constant-Q Fourier transforms (such as obtained from a classic third-octave filter bank) were not easy to invert, because the basis signals were not orthogonal."〕
The transform can be thought of as a series of logarithmically spaced filters, with the ''k''-th filter having a spectral width some multiple of the previous filter's width, i.e.
\begin
\delta f_k &= 2^ }
* \delta f_
\\ &= \left ( }} \right )^
* \delta f_
where δ''fk'' is the bandwidth of the kth filter, ''f''min is the centre frequency of the lowest filter, and ''n'' is the number of filters per octave.
== Calculation of the Transform ==

The short-time Fourier Transform of ''x''() for a frame shifted to sample ''m'' is calculated as follows:
:X() = \sum_^ W() x() e^ }
Given a data series, sampled at ''fs'' = 1/''T'', ''T'' being the sampling period of our data, for each frequency bin we can define the following:
* Filter width, δ''fk''
* ''Q'', the "quality factor". This is shown below to be the integer number of cycles processed at a center frequency ''fk''. As such, this somewhat defines the time complexity of the transform.
:: Q = \frac
* Window length for the ''k''-th bin
:: N() = \left( \frac \right) = \left( \frac \right) Q
:As ''S''/''fk'' is the number of samples processed per cycle at frequency ''fk'', ''Q'' is the number of integer cycles processed at this center frequency.
The equivalent transform kernel can be found by using the following substitutions:
* The window length of each bin is now a function of the bin number:
::N = N() = Q \frac
* The relative power of each bin will decrease with higher frequencies, as these sum over fewer terms. To compensate for this, we normalize by ''N''().
* Any windowing function will be a function of window length, and likewise a function of window number. For example, the equivalent Hamming window would be,
:: W() = \alpha - \left(1 - \alpha \right) \cos \left( \frac \right), \alpha = 25/46 , 0 \leqslant n \leqslant N() - 1
* Our digital frequency, \frac , becomes \frac
After these modifications, we are left with:
:X() = \frac \sum_^ W() x() e^}

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Constant Q transform」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.